The trend of green logistics pushes the use of electric vehicles into cold chain logistics. Concerning the problem that maintaining a low temperature environment requires a lot of energy in electric vehicle cold chain distribution， as well as the phenomena that the limited driving range and long charging time of electric vehicles make high operation cost， the Refrigerated Electric Vehicle Routing Problem （REVRP） in electric vehicle distribution was thought deeply. Considering the characteristics of electric vehicle energy consumption and the charging requirements of social recharging stations， a linear programming model was developed with the objective of minizing total distribution cost， and the objective function was composed of fixed cost and variable cost， in the variable cost， transportation cost and cooling cost were included. The capacity constraints and power constraints were considered in the model， and a Hybrid Ant Colony Optimization （HACO） algorithm was designed to solve this model. Especially， more attention was paid to designing transfer rules suitable for social recharging stations and four local optimization operators. Based on improving the Solomon benchmark examples， the small-scale and large-scale example sets were formed， and the performance of ACO algorithm and the optimization operators were through experiments. The experiment results show that ACO algorithm and CPLEX （WebSphere ILOG CPLEX） solver can find the exact solution in the small-scale example set， and ACO algorithm can save the operation time by 99.6% . In the large-scale example set， compared with ACO algorithm， HACO algorithm combing the four optimization operators has the average optimization efficiency increased by 4.45%. The proposed algorithm can obtain a feasible solution for REVRP in a limited time.

Wireless Sensor Network (WSN) was usually vulnerable to conspiracy attack from its adversaries when using bivariate polynomial key pre-distribution protocol. In order to solve this problem, a pre-distribution key management scheme for WSN was improved by reducing the amount of pairwise keys sharing between sensor nodes and changing the means of establishing pairwise keys between clusters. Analysis shows that the improved scheme not only maintains the advantages such as higher security of the original scheme, but also saves the limited memory storage of sensor nodes further, reduces the communication overhead of sensor nodes, extends the lifespan of the networks and can withstand conspiracy attack effectively.